Access Consistency Memory Model for Messengers 1
نویسندگان
چکیده
The messenger paradigm is an alternative to computer communication based on the exchange of programs called messengers which are afterwards executed, instead of messages that are interpreted. The communication by messenger paradigm can be used to implement both low level software such as communication protocols and high level software such as distributed applications. Using the messenger paradigm for computer communication requires that each host be \equipped" with a runtime environment called messenger platform that can execute messengers that reach the platform. M is one such platform. MOS is a distributed micro-kernel designed for the e cient execution of messengers and implemented on i386 machines; it contains a M platform. It supports the concurrent execution of messengers on a given node. Messengers running on the same node can exchange data through a common store. Messenger behavior is expressed in the M messenger language understood by all messenger platforms. M is an interpreted language. Messengers see the memory provided by a MOS as a set of dictionaries where information is stored as pairs consisting of a key and a value. The key is used to access the value associated to a given information. In this paper, we present a memory consistency model, called access consistency, that is well suited to implement a distributed shared memory to extend the common store available for messengers running on the same MOS node to spawn a network of MOS nodes; i.e, to allow messengers to share information irrespective of their physical location in the network.
منابع مشابه
Measuring Consistency Costs for Distributed Shared Data
Distributed Shared Memory (DSM) systems typically support one consistency model [3, 5, 6]. However, recent work [1, 11, 12, 14, 16] proposes the use of adaptive consistency based on a heuristical analysis of recent access patterns. Although heuristic-based approaches can significantly improve runtime, the access pattern alone does not necessarily define the most appropriate consistency model. T...
متن کاملA Measurement-Based Algorithm for Mapping Consistency Models to Shared Data
Distributed Shared Memory (DSM) systems often support exactly one consistency model for all shared data [ACD+96, BZS93]. Some recent systems support adaptive consistency using heuristical analysis of recent access patterns [ACD+99, Kel98, Kel99a, Kel99b, MB98]. Although approaches based on access patterns can significantly improve an application’s performance, there are other factors besides ac...
متن کاملView-Based Consistency and Its Implementation
This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a set of ordinary data objects that a processor has the right to access in a data-race-free program. The View-based Consistency model only requires that the data objects of a view are updated before a processor accesses them. Compared with other memory consistency models, the View-based Consistency...
متن کاملConstructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system a shared address space through which they can communicate with each other. The main problem of a DSM implementation on top of a message passing system is performance. Performance of an implementacion is closely related...
متن کاملView-based Consistency for Distributed Shared Memory
This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a set of data objects that a processor has the right to access in a data-race-free program. The View-based Consistency model requires that the data objects of a view are updated only before a processor accesses them. Compared with other memory consistency models, the View-based Consistency model ca...
متن کامل